Modeling Perceived Relevance for Tail Queries without Click-Through Data
نویسندگان
چکیده
Click-through data has been used in various ways in Web search such as estimating relevance between documents and queries. Since only search snippets are perceived by users before issuing any clicks, the relevance induced by clicks are usually called perceived relevance which has proven to be quite useful for Web search. While there is plenty of click data for popular queries, very little information is available for unpopular tail ones. These tail queries take a large portion of the search volume but search accuracy for these queries is usually unsatisfactory due to data sparseness such as limited click information. In this paper, we study the problem of modeling perceived relevance for queries without click-through data. Instead of relying on users’ click data, we carefully design a set of snippet features and use them to approximately capture the perceived relevance. We study the effectiveness of this set of snippet features in two settings: (1) predicting perceived relevance and (2) enhancing search engine ranking. Experimental results show that our proposed model is effective to predict the relative perceived relevance of Web search results. Furthermore, our proposed snippet features are effective to improve search accuracy for longer tail queries without click-through data.
منابع مشابه
Pitt at TREC 2013: Different Effects of Click-through and Past Queries on Whole-session Search Performance
Past search queries and click-through information within a search session have been heavily exploited to improve search performance. However, it remains unclear how do these two data source contribute to whole-session search performance due to the lack of reliable evaluation approaches. For example, as pointed out last year (Jiang, He, & Han, 2012), using past search queries as relevance feedba...
متن کاملIncorporating Semantic Knowledge into Latent Matching Model in Search
The relevance between a query and a document in search can be represented as matching degree between the two objects. Latent space models have been proven to be effective for the task, which are often trained with click-through data. One technical challenge with the approach is that it is hard to train a model for tail queries and tail documents for which there are not enough clicks. In this pa...
متن کاملSession Based Click Features for Recency Ranking
Recency ranking refers to the ranking of web results by accounting for both relevance and freshness. This is particularly important for “recency sensitive” queries such as breaking news queries. In this study, we propose a set of novel click features to improve machine learned recency ranking. Rather than computing simple aggregate click through rates, we derive these features using the tempora...
متن کاملMissing Click History in Sponsored Search: A Generative Modeling Solution
A fundamental problem in sponsored search advertising is the estimation of probability of click for ads displayed in response to search queries. The historical click-through rate (CTR) is one of the most important predictors of the click, and extracted at multiple resolutions of the query-ad hierarchy. However, the new ads do not have any click history, and even the existing ads might miss hist...
متن کاملLearning Query Intent for Sponsored Search
As sponsored search contributes the major income of many search engines, how to deliver ads effectively is studied intensively from both industrial and academia. Among various previous studies, many of them are keyword relevance based and few considered the underlying user intents behind queries for ads delivery. In this paper, we propose to classify search queries into different search intent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1110.1112 شماره
صفحات -
تاریخ انتشار 2011